FAST ROBUST ARITHMETICS FOR GEOMETRIC ALGORITHMS AND APPLICATIONS TO GIS

Abstract. Geometric predicates are used in many GIS algorithms, such as the construction of Delaunay Triangulations for Triangulated Irregular Networks (TIN) or geospatial predicates. With floating-point arithmetic, these computations can incur roundoff errors that may lead to incorrect results and inconsistencies, causing fail. This issue has been addressed using a combination exact arithmetics robustness filters mitigate computational cost computations. The implementation be difficult task, code generation tools have proposed address this. We present new C++ meta-programming framework fast, robust arbitrary geometric based on polynomial expressions. show examples how this approach produces correct data sets could predicate naive implementations. also benchmark demonstrate our compete with state-of-the-art solutions.